Call-correct Specialisation of Logic Programs
نویسنده
چکیده
In this paper we introduce the concept of specialisable call correct program. It is based on the notion of specialised derivation which is intended to describe program behaviour whenever some constraints on procedure calls are assumed. Both operational and xpoint constructions are deened. They characterize successful derivations of programs where only atoms satisfying a given call-condition are selected. We show that specialisable call correct programs can be transformed into call-correct ones. A suucient condition to verify specialisable call correctness is stated.
منابع مشابه
Specialising Logic Programs with Respect to Call?Post Specifications
In this paper we present a program specialisation method which, given a call/post speciication, transforms a logic program into a weakly call-correct one satisfying the post-condition. The specialisation is applied to specialised partially correct programs. This notion is based on the deenition of specialised derivation which is intended to describe program behaviour whenever some properties on...
متن کاملSpecialising Logic Programs with Respect to Call/post Speciications
In this paper we present a program specialisation which, given a call/post speciication, transforms a logic program into a call-correct one satisfying the post-condition. The specialisation is applied to specialised partially correct programs. This notion is based on the deenition of specialised derivation which is intended to describe program behaviour whenever some properties on procedure cal...
متن کاملDeterminacy Inference for Logic Programs
This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most one answer and that answer is generated only once. The principal component of the technique is a goalindependent analysis of individual clauses. This derives a condition for a call that ensures only one clause in the m...
متن کاملBottom up Specialisation: towards General Foundations ?
In this abstract, we develop a solid theoretical foundation for a bottom-up program specialisation technique, capable of specialising a logic program w.r.t. a set of unit clauses. Extending a well-known operator, originally introduced for composing logic programs, we deene a bottom-up partial deduction operator and prove correctness of the transformation with respect to the S-semantics.
متن کاملA Self - Applicable Partial Evaluator for the Logic Programming Language
Partial evaluation is a program specialisation technique that has been shown to have great potential in logic programming, particularly for the specialisation of meta-interpreters by the so-called " Futamura Projections ". Meta-interpreters and other meta-programs are programs which use another program as data. The Futamura projections also show that partial evaluator which is self-applicable (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998